Approximate Cech Complexes in Low and High Dimensions
نویسندگان
چکیده
Čech complexes reveal valuable topological information about point sets at a certain scale in arbitrary dimensions, but the sheer size of these complexes limits their practical impact. While recent work introduced approximation techniques for filtrations of (Vietoris-)Rips complexes, a coarser version of Čech complexes, we propose the approximation of Čech filtrations directly. For fixed dimensional point set S, we present an approximation of the Čech filtration of S by a sequence of complexes of size linear in the number of points. We generalize wellseparated pair decompositions (WSPD) to well-separated simplicial decomposition (WSSD) in which every simplex defined on S is covered by some element of WSSD. We give an efficient algorithm to compute a linear-sized WSSD in fixed dimensional spaces. Using a WSSD, we then present a linear-sized approximation of the filteration of Čech complex of S. We also present a generalization of the known fact that the Rips complex approximates the Čech complex by a factor of √ 2. We define a class of complexes that interpolate between Čech and Rips complexes and that, given any parameter ε > 0, approximate the Čech complex by a factor (1+ ε). Our complex can be represented by roughly O(n⌈1/2ε⌉) simplices without any hidden dependance on the ambient dimension of the point set. Our results are based on an interesting link between Čech complex and coresets for minimum enclosing ball of highdimensional point sets. As a consequence of our analysis, we show improved bounds on coresets that approximate the radius of the minimum enclosing ball.
منابع مشابه
Satisfaction of Residents of Tehran Residential Towers from Cultural Aspect (Case Study: A.S.P Residential Tower and Tehran International Tower)
Today, urbanization (living at apartments) phenomenon as the most common type of residence of cities has been changed so that mainly reflects the chaos in this area. Too much attention paid to economic indicators compromised the balance in the housing sector and created a new type of buildings. The occurred changes indicate ignoring cultural characteristics, less attention paid to cultural conc...
متن کاملApproximate Dynamic Analysis of Structures for Earthquake Loading Using FWT
Approximate dynamic analysis of structures is achieved by fast wavelet transform (FWT). The loads are considered as time history earthquake loads. To reduce the computational work, FWT is used by which the number of points in the earthquake record are reduced. For this purpose, the theory of wavelets together with filter banks are used. The low and high pass filters are used for the decompositi...
متن کاملVietoris-Rips and Cech Complexes of Metric Gluings
We study Vietoris–Rips and Čech complexes of metric wedge sums and metric gluings. We show that the Vietoris–Rips (resp. Čech) complex of a wedge sum, equipped with a natural metric, is homotopy equivalent to the wedge sum of the Vietoris–Rips (resp. Čech) complexes. We also provide generalizations for certain metric gluings, i.e. when two metric spaces are glued together along a common isometr...
متن کاملApproximate Čech Complex in Low and High Dimensions
Čech complexes reveal valuable topological information about point sets at a certain scale in arbitrary dimensions, but the sheer size of these complexes limits their practical impact. While recent work introduced approximation techniques for filtrations of (Vietoris-)Rips complexes, a coarser version of Čech complexes, we propose the approximation of Čech filtrations directly. For fixed dimens...
متن کاملComparing MapReduce-Based k-NN Similarity Joins on Hadoop for High-Dimensional Data
Similarity joins represent a useful operator for data mining, data analysis and data exploration applications. With the exponential growth of data to be analyzed, distributed approaches like MapReduce are required. So far, the state-of-the-art similarity join approaches based on MapReduce mainly focused on the processing of low-dimensional vector data. In this paper, we revisit and investigate ...
متن کامل